Rook placements and cellular decomposition of partition varieties
نویسندگان
چکیده
منابع مشابه
m-Level rook placements
Goldman, Joichi, and White proved a beautiful theorem showing that the falling factorial generating function for the rook numbers of a Ferrers board factors over the integers. Briggs and Remmel studied an analogue of rook placements where rows are replaced by sets of m rows called levels. They proved a version of the factorization theorem in that setting, but only for certain Ferrers boards. We...
متن کاملPattern Avoiding Permutations & Rook Placements
First, we look at the distribution of permutation statistics in the context of pattern-avoiding permutations. The first part of this chapter deals with a recursively defined bijection of Robertson [6] between 123and 132-avoiding permutations. We introduce the general notion of permutation templates and pivots in order to give a non-recursive pictorial reformulation of Robertson’s bijection. Thi...
متن کاملPatterns in matchings and rook placements
Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings, have an interpretation, in the case of matchings, in terms of patterns in full rook placements on Ferrers boards. We enumerate 312-avoiding matchings and pa...
متن کاملMatrix Ansatz, lattice paths and rook placements
We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP. Besides other interpretations, this formula gives the generating function for permutations of a given size with respect to the number of ascents and occurrence...
متن کاملBijections on m-level rook placements
Suppose the rows of a board are partitioned into sets of m rows called levels. An m-level rook placement is a subset of the board where no two squares are in the same column or the same level. We construct explicit bijections to prove three theorems about such placements. We start with two bijections between Ferrers boards having the same number of m-level rook placements. The first generalizes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00002-7